Type-based bigram frequencies for five-letter words
نویسندگان
چکیده
منابع مشابه
Type and token bigram frequencies for two-through nine-letter words and the prediction of anagram difficulty.
Recent research on anagram solution has produced two original findings. First, it has shown that a new bigram frequency measure called top rank, which is based on a comparison of summed bigram frequencies, is an important predictor of anagram difficulty. Second, it has suggested that the measures from a type count are better than token measures at predicting anagram difficulty. Testing these hy...
متن کاملUnequal letter frequencies in ternary square-free words
We consider the set S of triples (x, y, z) corresponding to the frequency of each alphabet letter in some infinite ternary square-free word (so x + y+ z = 1). We conjecture that this set is convex. We obtain bounds on S by with a generalization of our method to bound the extremal frequency of one letter. This method uses weights on the alphabet letters. Finally, we obtain positive results, that...
متن کاملUniformly balanced words with linear complexity and prescribed letter frequencies
We consider the following problem. Let us fix a finite alphabet A = {1,2, · · · ,d}; for any d-uple of letter frequencies ( f1, · · · , fd) ∈ [0,1]d with ∑i=1 fi = 1, how to construct an infinite word u over the alphabet A satisfying the following conditions: u has linear complexity function, u is uniformly balanced, the letter frequencies in u are given by ( f1, · · · , fd). This paper investi...
متن کاملBigram Anchor Words Topic Model
A probabilistic topic model is a modern statistical tool for document collection analysis that allows extracting a number of topics in the collection and describes each document as a discrete probability distribution over topics. Classical approaches to statistical topic modeling can be quite effective in various tasks, but the generated topics may be too similar to each other or poorly interpr...
متن کاملOn the Entropy and Letter Frequencies of Powerfree Words
We review the recent progress in the investigation of powerfree words, with particular emphasis on binary cubefree and ternary squarefree words. Besides various bounds on the entropy, we provide bounds on letter frequencies and consider their empirical distribution obtained by an enumeration of binary cubefree words up to length 80.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Behavior Research Methods, Instruments, & Computers
سال: 2004
ISSN: 0743-3808,1532-5970
DOI: 10.3758/bf03195587